Query time versus redundancy trade-offs for range queries
نویسندگان
چکیده
منابع مشابه
Query Time Versus Redundancy Trade-Offs for Range Queries
Let A(l),A(2),...,A(n) be an array which stores values in a commutative semi-group S. We are concerned with the design of data structures for representing the array A(i) which facilitate implementation of the range queries Retrieve(j, k) defined as follows. Retrieve(j, k) (l<j<k&n) Return i A(i). i=j An obvious data structure would be the array A(j) itself. This approach has the disadvantage th...
متن کاملSpace-time trade-offs for some ranking and searching queries
We study space/time tradeoffs for querying some combinatorial structures. In the first, given an arrangement of n lines in general position in the plane, a query for a real number t asks about Rank(t), the number of vertices of the arrangement with x-coordinates ≤ t. We show that for K = O(n/logn), after a preprocessing step that uses space S = O(n/(K logK)) the query can be answered in time O(...
متن کاملTime-space Trade-offs for Voronoi Diagrams
Let S be a planar n-point set. Classically, one can find the Voronoi diagram VD(S) for S in O(n log n) time and O(n) space. We study the situation when the available workspace is limited: for s ∈ {1, . . . , n}, an s-workspace algorithm has read-only access to an input array with the points from S in arbitrary order, and it may use only O(s) additional words of Θ(log n) bits for reading and wri...
متن کاملOptimal Time-Space Trade-Offs for Sorting
We study the fundamental problem of sorting in a sequential model of computation and in particular consider the time-space trade-off (product of time and space) for this problem. Beame has shown a lower bound of Ω(n) for this product leaving a gap of a logarithmic factor up to the previously best known upper bound of O(n log n) due to Frederickson. Since then, no progress has been made towards ...
متن کاملSimple Space-Time Trade-Offs for AESA
We consider indexing and range searching in metric spaces. The best method known is AESA, in practice requiring the fewest number of distance evaluations to answer range queries. The problem with AESA is its space complexity, requiring storage for Θ(n) distance values to index n objects. We give several methods to reduce this cost. The main observation is that exact distance values are not need...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1981
ISSN: 0022-0000
DOI: 10.1016/0022-0000(81)90071-4